A General Framework for Cooperative Co-evolutionary Algorithms: a Society Model
نویسنده
چکیده
Cooperative Co-evolutionary Algorithms: A Society Model Qiangfu Zhao The University of Aizu, Japan 965-80 E-mail: [email protected] Abstract| Compared with the conventional algorithms, the evolutionary algorithms (EAs) are usually more e cient for system design because they can provide higher opportunity for obtaining the global optimal solution. However, the EAs cannot be used directly to design large-scale systems because a large amount of computations are required. To solve this problem, many approaches have been proposed in the literature. The cooperative co-evolutionary algorithms (CCEA) is possibly one of the most e cient approaches. The basic idea of most CCEAs is divide-and-conquer: divide the system into many modules, de ne an individual as a candidate of a module, assign a population to each module, nd good individuals within each population, and put them together again to form the whole system. In this paper, we generalize our earlier studies, and introduce a society model for the study of CCEAs. Based on the society model, we will formulate existing CCEAs in a general framework. We will also provide several case studies, all of which are interesting topics for future researches.
منابع مشابه
General form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملCooperative Co-evolutionary Algorithm - How to Evaluate a Module ?
When we talk about co-evolution, we often consider it as competitive co-evolution (CompCE). Examples include co-evolution of training data and neural networks, co-evolution of game players, and so on. Recently, several researchers have studied another kind of co-evolution — cooperative co-evolution (CoopCE). While CompCE tries to get more competitive individuals through evolution, the goal of C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998